Efficient scalar multiplication of ECC using SMBR and fast septuple formula for IoT

نویسندگان

چکیده

Abstract In order to solve the problem between low power of Internet Things devices and high cost cryptography, lightweight cryptography is required. The improvement scalar multiplication can effectively reduce complexity elliptic curve (ECC). this paper, we propose a fast formula for point septupling on curves over binary fields using division polynomial multiplexing intermediate values accelerate computation by more than 14%. We also algorithm based step multi-base representation halving septuple proposed, which significantly reduces computational cost. experimental results show that our method efficient contributes reducing ECC.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Scalar Multiplication in ECC using The Multi base Number System

As a generalization of double base chains, multibase number system is very suitable for efficient computation of scalar multiplication of a point of elliptic curve because of shorter representation length and hamming weight. In this paper combined with the given formulas for computing the 7Fold of an elliptic curve point P an efficient scalar multiplication algorithm of elliptic curve is propos...

متن کامل

Analysis of Multibase Scalar Point Multiplication Scheme in ECC

Development and research in cryptography has shown that RSA and Diffie-Hellman has is becoming more and more unsafe and Elliptic curve Cryptography is becoming a new trend in future for public key cryptosystem. The safety level of ECC with small size key is same as that of earlier cryptosystem with large size key. In this paper Nicolas Meloni’s,2 2012 springer algorithm for addition of points o...

متن کامل

Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks

Recently it has been shown that smart cards as cryptographic devices are vulnerable to power attacks if they have no defence against them. Randomization on ECC scalar multiplication is one of the fundamental concepts in methods of defence against side-channel attacks. In this paper by using the randomization concept together with the NAF recoding algorithm, we propose an efficient countermeasur...

متن کامل

Fast GPGPU-Based Elliptic Curve Scalar Multiplication

This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...

متن کامل

An Efficient Elliptic Curve Scalar Multiplication using Karatsuba Multiplier

In this era, network security is becoming a great concern .Cryptography offers high security for communication and networking. Elliptic Curve Cryptography is gaining attraction with their high level of security with low cost, small key size and smaller hardware realization. Elliptic curve scalar multiplication is the most important operation in elliptic curve cryptosystems This paper develops a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Eurasip Journal on Wireless Communications and Networking

سال: 2021

ISSN: ['1687-1499', '1687-1472']

DOI: https://doi.org/10.1186/s13638-021-01967-7